Permutation actions on Quiver Grassmannians for the equioriented cycle via GKM-theory
نویسندگان
چکیده
Abstract In our previous work, we equipped quiver Grassmannians for nilpotent representations of the equioriented cycle with an action algebraic torus. We show here that equivariant cohomology ring is acted upon by a product symmetric groups and investigate this permutation via GKM techniques. case (type A) flag varieties, or Schubert varieties therein, recover Tymoczko’s results on representations.
منابع مشابه
On the Cardinalities of Kronecker Quiver Grassmannians
Abstract. We deduce using the Ringel-Hall algebra approach explicit formulas for the cardinalities of some Grassmannians over a finite field associated to the Kronecker quiver. We realize in this way a quantification of the formulas obtained by Caldero and Zelevinsky for the Euler characteristics of these Grassmannians. We also present a recursive algorithm for computing the cardinality of ever...
متن کاملGkm Theory for Torus Actions with Non-isolated Fixed Points
LetM be a compact symplectic manifold and T a compact n-dimensional torus. A Hamiltonian action, τ , of T on M is a GKM action if, for every p ∈ M , the isotropy representation of T on TpM has pair-wise linearly independent weights. For such an action the projection of the set of zero and one-dimensional orbits onto M/T is a regular dvalent graph; and Goresky, Kottwitz and MacPherson have prove...
متن کاملQuiver Grassmannians, Quiver Varieties and the Preprojective Algebra
Quivers play an important role in the representation theory of algebras, with a key ingredient being the path algebra and the preprojective algebra. Quiver grassmannians are varieties of submodules of a fixed module of the path or preprojective algebra. In the current paper, we study these objects in detail. We show that the quiver grassmannians corresponding to submodules of certain injective ...
متن کاملOn the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملCombinatorial realizations of crystals via torus actions on quiver varieties
Let V (λ) be a highest-weight representation of a symmetric Kac–Moody algebra, and let B(λ) be its crystal. There is a geometric realization of B(λ) using Nakajima’s quiver varieties. In many particular cases one can also realize B(λ) by elementary combinatorial methods. Here we study a general method of extracting combinatorial realizations from the geometric picture: we use Morse theory to in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2023
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-022-01211-5